Ranking by weighted sum

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating Sum by Weighted Sampling

We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarantees on the estimated sum. In this paper we consider various sampling methods besides uniform sampling, in particular sampling a variable with probability proportional to its value, referred to as linear weighted sampli...

متن کامل

Server Selection by using Weighted Sum and Revised Weighted Sum Decision Models

The role of the information technology is growing rapidly in the world of business, to communicate with the customers effectively. Computer network is the back bone of any organization. It helps in effective utilization of resources such as time, money etc. Server plays an important role in the network, to store the data. A wide variety of servers exist in the market. This paper focuses on the ...

متن کامل

Shallow Parsing By Weighted Probabilistic Sum

In this paper, we define the chunking problem as a classification of words and present a weighted probabilistic model for a text chunking. The proposed model exploits context features around the focus word. And to alleviate the sparse data problem, it integrates general features with specific features. In the training stage, we select useful features after measuring information gain ratio of ea...

متن کامل

Weighted Gcd-Sum Functions

We investigate weighted gcd-sum functions, including the alternating gcd-sum function and those having as weights the binomial coefficients and values of the Gamma function. We also consider the alternating lcm-sum function.

متن کامل

Confidence-Weighted Bipartite Ranking

Bipartite ranking is a fundamental machine learning and data mining problem. It commonly concerns the maximization of the AUC metric. Recently, a number of studies have proposed online bipartite ranking algorithms to learn from massive streams of class-imbalanced data. These methods suggest both linear and kernel-based bipartite ranking algorithms based on first and second-order online learning...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Economic Theory

سال: 2020

ISSN: 0938-2259,1432-0479

DOI: 10.1007/s00199-020-01305-w